On the Design of Simple Multi-unit Online Auctions

نویسندگان

  • Thomas Kittsteiner
  • Axel Ockenfels
چکیده

The increased use of online market places (like eBay) by professional traders and small businesses goes along with an increase in demand for online multi-unit auction designs. A seller with many objects for sale might consider it inconvenient to initiate and monitor a single auction for each individual item and thus might favour the use of a multi-unit auction. However, the design of online multi-unit auctions can be substantially more difficult than that of single-unit auctions. In fact, the theoretical as well as empirical literature on multi-unit auctions is much less developed. New difficulties such as market power and computational complexities arise when objects are heterogeneous or bidders demand multiple items. In addition, there is a conflict between simplicity of auction rules and their efficiency (and revenue). If objects for sale are complements, to obtain the optimal performance (at least from a theoretical point of view) the auction design usually requires that bidders specify their preferences on any possible package of the N objects. Thus each bidder has to submit 2-1 numbers (as he might value any subset of the items for sale differently) . Especially for a large number of objects such an auction is often infeasible. Multi-unit auction design is considerably simpler if one can assume that each bidder just demands one object (or, more generally, if objects are substitutes). As we will argue below, under this unit-demand assumption, the standard single-unit auction format used on eBay can be naturally extended to a multi-unit design. In what follows we will first describe the single-unit auction format used by eBay and then demonstrate how it can be adjusted to allow for the simultaneous sale of many objects. We

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

Using Transaction Data for the Design of Sequential, Multi-unit, Online Auctions

1 We acknowledge the helpful comments on earlier versions of this work from seminar participants at Abstract Internet auctions for consumers' goods are an increasingly popular selling venue. The Internet's computational ability makes possible the sale of multiple units of the same good in a single auction. Many sellers, instead of offering the entire inventory at a single auction, split it into...

متن کامل

Clinching Auctions with Online Supply

Auctions for perishable goods such as internet ad inventory need to make real-time allocationand pricing decisions as the supply of the good arrives in an online manner, without knowing theentire supply in advance. These allocation and pricing decisions get complicated when buyershave some global constraints. In this work, we consider a multi-unit model where buyers haveglob...

متن کامل

Multi-Unit Auctions

We survey experimental research on multi-unit auctions with an emphasis on topics that may be of a unifying interest to experimental, as well as theoretical and empirical economists. Topics include static and dynamic multi-unit auctions; combinatorial auctions and efficient auction design; simultaneous and sequential auctions; bidder asymmetry and endogenous entry, and collusion in auctions. We...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006